TSTP Solution File: ITP053^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP053^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:06:47 EDT 2024
% Result : Theorem 0.39s 0.62s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 21
% Syntax : Number of formulae : 38 ( 20 unt; 15 typ; 0 def)
% Number of atoms : 26 ( 25 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 171 ( 7 ~; 2 |; 0 &; 161 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 4 ( 4 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 17 ( 2 ^ 15 !; 0 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
product_prod_nat_nat: $tType ).
thf(decl_sort2,type,
capacity: $tType ).
thf(decl_sort3,type,
nat: $tType ).
thf(decl_sort4,type,
list_P559422087at_nat: $tType ).
thf(decl_27,type,
min_dist_capacity: ( product_prod_nat_nat > capacity ) > nat > nat > nat ).
thf(decl_28,type,
one_one_nat: nat ).
thf(decl_29,type,
plus_plus_nat: nat > nat > nat ).
thf(decl_32,type,
size_s1990949619at_nat: list_P559422087at_nat > nat ).
thf(decl_49,type,
c: product_prod_nat_nat > capacity ).
thf(decl_50,type,
p: list_P559422087at_nat ).
thf(decl_51,type,
p1: list_P559422087at_nat ).
thf(decl_52,type,
p2: list_P559422087at_nat ).
thf(decl_54,type,
s: nat ).
thf(decl_55,type,
t: nat ).
thf(decl_56,type,
u: nat ).
thf(conj_0,conjecture,
( ( min_dist_capacity @ c @ u @ t )
= ( plus_plus_nat @ one_one_nat @ ( size_s1990949619at_nat @ p2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uUtyjaY9eT/E---3.1_17180.p',conj_0) ).
thf(fact_23_add_Ocommute,axiom,
( plus_plus_nat
= ( ^ [X13: nat,X14: nat] : ( plus_plus_nat @ X14 @ X13 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uUtyjaY9eT/E---3.1_17180.p',fact_23_add_Ocommute) ).
thf(fact_2__092_060open_062min__dist_As_At_A_061_Alength_Ap1_A_L_A_I1_A_L_Alength_Ap2_J_A_092_060Longrightarrow_062_Amin__dist_Au_At_A_061_A1_A_L_Alength_Ap2_092_060close_062,axiom,
( ( ( min_dist_capacity @ c @ s @ t )
= ( plus_plus_nat @ ( size_s1990949619at_nat @ p1 ) @ ( plus_plus_nat @ one_one_nat @ ( size_s1990949619at_nat @ p2 ) ) ) )
=> ( ( min_dist_capacity @ c @ u @ t )
= ( plus_plus_nat @ one_one_nat @ ( size_s1990949619at_nat @ p2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uUtyjaY9eT/E---3.1_17180.p',fact_2__092_060open_062min__dist_As_At_A_061_Alength_Ap1_A_L_A_I1_A_L_Alength_Ap2_J_A_092_060Longrightarrow_062_Amin__dist_Au_At_A_061_A1_A_L_Alength_Ap2_092_060close_062) ).
thf(fact_0_MIN_H,axiom,
( ( min_dist_capacity @ c @ s @ t )
= ( plus_plus_nat @ ( plus_plus_nat @ ( size_s1990949619at_nat @ p1 ) @ one_one_nat ) @ ( size_s1990949619at_nat @ p2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uUtyjaY9eT/E---3.1_17180.p',fact_0_MIN_H) ).
thf(fact_4_MIN,axiom,
( ( min_dist_capacity @ c @ s @ t )
= ( size_s1990949619at_nat @ p ) ),
file('/export/starexec/sandbox/tmp/tmp.uUtyjaY9eT/E---3.1_17180.p',fact_4_MIN) ).
thf(fact_22_add_Oleft__commute,axiom,
! [X7: nat,X6: nat,X8: nat] :
( ( plus_plus_nat @ X7 @ ( plus_plus_nat @ X6 @ X8 ) )
= ( plus_plus_nat @ X6 @ ( plus_plus_nat @ X7 @ X8 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uUtyjaY9eT/E---3.1_17180.p',fact_22_add_Oleft__commute) ).
thf(c_0_6,negated_conjecture,
( ( min_dist_capacity @ c @ u @ t )
!= ( plus_plus_nat @ one_one_nat @ ( size_s1990949619at_nat @ p2 ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_7,plain,
! [X1013: nat,X1014: nat] :
( ( plus_plus_nat @ X1013 @ X1014 )
= ( plus_plus_nat @ X1014 @ X1013 ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_23_add_Ocommute])]) ).
thf(c_0_8,plain,
( ( ( min_dist_capacity @ c @ s @ t )
!= ( plus_plus_nat @ ( size_s1990949619at_nat @ p1 ) @ ( plus_plus_nat @ one_one_nat @ ( size_s1990949619at_nat @ p2 ) ) ) )
| ( ( min_dist_capacity @ c @ u @ t )
= ( plus_plus_nat @ one_one_nat @ ( size_s1990949619at_nat @ p2 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2__092_060open_062min__dist_As_At_A_061_Alength_Ap1_A_L_A_I1_A_L_Alength_Ap2_J_A_092_060Longrightarrow_062_Amin__dist_Au_At_A_061_A1_A_L_Alength_Ap2_092_060close_062])]) ).
thf(c_0_9,negated_conjecture,
( ( min_dist_capacity @ c @ u @ t )
!= ( plus_plus_nat @ one_one_nat @ ( size_s1990949619at_nat @ p2 ) ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
( ( min_dist_capacity @ c @ s @ t )
= ( plus_plus_nat @ ( plus_plus_nat @ ( size_s1990949619at_nat @ p1 ) @ one_one_nat ) @ ( size_s1990949619at_nat @ p2 ) ) ),
inference(split_conjunct,[status(thm)],[fact_0_MIN_H]) ).
thf(c_0_11,plain,
( ( min_dist_capacity @ c @ s @ t )
= ( size_s1990949619at_nat @ p ) ),
inference(split_conjunct,[status(thm)],[fact_4_MIN]) ).
thf(c_0_12,plain,
! [X1094: nat,X1095: nat] :
( ( plus_plus_nat @ X1094 @ X1095 )
= ( plus_plus_nat @ X1095 @ X1094 ) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
thf(c_0_13,plain,
( ( ( min_dist_capacity @ c @ u @ t )
= ( plus_plus_nat @ one_one_nat @ ( size_s1990949619at_nat @ p2 ) ) )
| ( ( min_dist_capacity @ c @ s @ t )
!= ( plus_plus_nat @ ( size_s1990949619at_nat @ p1 ) @ ( plus_plus_nat @ one_one_nat @ ( size_s1990949619at_nat @ p2 ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,negated_conjecture,
( ( min_dist_capacity @ c @ u @ t )
!= ( plus_plus_nat @ one_one_nat @ ( size_s1990949619at_nat @ p2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X1091: nat,X1092: nat,X1093: nat] :
( ( plus_plus_nat @ X1091 @ ( plus_plus_nat @ X1092 @ X1093 ) )
= ( plus_plus_nat @ X1092 @ ( plus_plus_nat @ X1091 @ X1093 ) ) ),
inference(variable_rename,[status(thm)],[fact_22_add_Oleft__commute]) ).
thf(c_0_16,plain,
( ( plus_plus_nat @ ( plus_plus_nat @ ( size_s1990949619at_nat @ p1 ) @ one_one_nat ) @ ( size_s1990949619at_nat @ p2 ) )
= ( size_s1990949619at_nat @ p ) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_17,plain,
! [X2: nat,X1: nat] :
( ( plus_plus_nat @ X1 @ X2 )
= ( plus_plus_nat @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,plain,
( ( plus_plus_nat @ ( size_s1990949619at_nat @ p1 ) @ ( plus_plus_nat @ one_one_nat @ ( size_s1990949619at_nat @ p2 ) ) )
!= ( size_s1990949619at_nat @ p ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_14]) ).
thf(c_0_19,plain,
! [X1: nat,X2: nat,X3: nat] :
( ( plus_plus_nat @ X1 @ ( plus_plus_nat @ X2 @ X3 ) )
= ( plus_plus_nat @ X2 @ ( plus_plus_nat @ X1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_20,plain,
( ( plus_plus_nat @ ( size_s1990949619at_nat @ p2 ) @ ( plus_plus_nat @ one_one_nat @ ( size_s1990949619at_nat @ p1 ) ) )
= ( size_s1990949619at_nat @ p ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
thf(c_0_21,plain,
( ( plus_plus_nat @ one_one_nat @ ( plus_plus_nat @ ( size_s1990949619at_nat @ p2 ) @ ( size_s1990949619at_nat @ p1 ) ) )
!= ( size_s1990949619at_nat @ p ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
thf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.16 % Problem : ITP053^1 : TPTP v8.1.2. Released v7.5.0.
% 0.12/0.17 % Command : run_E %s %d THM
% 0.17/0.38 % Computer : n026.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Fri May 3 12:32:21 EDT 2024
% 0.17/0.38 % CPUTime :
% 0.39/0.55 Running higher-order theorem proving
% 0.39/0.55 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.uUtyjaY9eT/E---3.1_17180.p
% 0.39/0.62 # Version: 3.1.0-ho
% 0.39/0.62 # Preprocessing class: HSLSSMSMSSSNHSA.
% 0.39/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.62 # Starting new_ho_10 with 1500s (5) cores
% 0.39/0.62 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.39/0.62 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.39/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.62 # new_ho_10 with pid 17259 completed with status 0
% 0.39/0.62 # Result found by new_ho_10
% 0.39/0.62 # Preprocessing class: HSLSSMSMSSSNHSA.
% 0.39/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.62 # Starting new_ho_10 with 1500s (5) cores
% 0.39/0.62 # No SInE strategy applied
% 0.39/0.62 # Search class: HGHSM-FSLM31-MHSFFSBC
% 0.39/0.62 # partial match(1): HGHSM-FSLM31-MHSFFSBN
% 0.39/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.62 # Starting almost_fo_1 with 811s (1) cores
% 0.39/0.62 # Starting new_ho_10 with 151s (1) cores
% 0.39/0.62 # Starting post_as_ho3 with 136s (1) cores
% 0.39/0.62 # Starting full_lambda_10 with 136s (1) cores
% 0.39/0.62 # Starting full_lambda_5 with 136s (1) cores
% 0.39/0.62 # new_ho_10 with pid 17267 completed with status 0
% 0.39/0.62 # Result found by new_ho_10
% 0.39/0.62 # Preprocessing class: HSLSSMSMSSSNHSA.
% 0.39/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.62 # Starting new_ho_10 with 1500s (5) cores
% 0.39/0.62 # No SInE strategy applied
% 0.39/0.62 # Search class: HGHSM-FSLM31-MHSFFSBC
% 0.39/0.62 # partial match(1): HGHSM-FSLM31-MHSFFSBN
% 0.39/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.62 # Starting almost_fo_1 with 811s (1) cores
% 0.39/0.62 # Starting new_ho_10 with 151s (1) cores
% 0.39/0.62 # Preprocessing time : 0.007 s
% 0.39/0.62 # Presaturation interreduction done
% 0.39/0.62
% 0.39/0.62 # Proof found!
% 0.39/0.62 # SZS status Theorem
% 0.39/0.62 # SZS output start CNFRefutation
% See solution above
% 0.39/0.62 # Parsed axioms : 302
% 0.39/0.62 # Removed by relevancy pruning/SinE : 0
% 0.39/0.62 # Initial clauses : 474
% 0.39/0.62 # Removed in clause preprocessing : 69
% 0.39/0.62 # Initial clauses in saturation : 405
% 0.39/0.62 # Processed clauses : 189
% 0.39/0.62 # ...of these trivial : 3
% 0.39/0.62 # ...subsumed : 56
% 0.39/0.62 # ...remaining for further processing : 129
% 0.39/0.62 # Other redundant clauses eliminated : 27
% 0.39/0.62 # Clauses deleted for lack of memory : 0
% 0.39/0.62 # Backward-subsumed : 3
% 0.39/0.62 # Backward-rewritten : 7
% 0.39/0.62 # Generated clauses : 27
% 0.39/0.62 # ...of the previous two non-redundant : 17
% 0.39/0.62 # ...aggressively subsumed : 0
% 0.39/0.62 # Contextual simplify-reflections : 0
% 0.39/0.62 # Paramodulations : 0
% 0.39/0.62 # Factorizations : 0
% 0.39/0.62 # NegExts : 0
% 0.39/0.62 # Equation resolutions : 27
% 0.39/0.62 # Disequality decompositions : 0
% 0.39/0.62 # Total rewrite steps : 29
% 0.39/0.62 # ...of those cached : 11
% 0.39/0.62 # Propositional unsat checks : 0
% 0.39/0.62 # Propositional check models : 0
% 0.39/0.62 # Propositional check unsatisfiable : 0
% 0.39/0.62 # Propositional clauses : 0
% 0.39/0.62 # Propositional clauses after purity: 0
% 0.39/0.62 # Propositional unsat core size : 0
% 0.39/0.62 # Propositional preprocessing time : 0.000
% 0.39/0.62 # Propositional encoding time : 0.000
% 0.39/0.62 # Propositional solver time : 0.000
% 0.39/0.62 # Success case prop preproc time : 0.000
% 0.39/0.62 # Success case prop encoding time : 0.000
% 0.39/0.62 # Success case prop solver time : 0.000
% 0.39/0.62 # Current number of processed clauses : 92
% 0.39/0.62 # Positive orientable unit clauses : 33
% 0.39/0.62 # Positive unorientable unit clauses: 2
% 0.39/0.62 # Negative unit clauses : 6
% 0.39/0.62 # Non-unit-clauses : 51
% 0.39/0.62 # Current number of unprocessed clauses: 233
% 0.39/0.62 # ...number of literals in the above : 766
% 0.39/0.62 # Current number of archived formulas : 0
% 0.39/0.62 # Current number of archived clauses : 10
% 0.39/0.62 # Clause-clause subsumption calls (NU) : 632
% 0.39/0.62 # Rec. Clause-clause subsumption calls : 601
% 0.39/0.62 # Non-unit clause-clause subsumptions : 47
% 0.39/0.62 # Unit Clause-clause subsumption calls : 104
% 0.39/0.62 # Rewrite failures with RHS unbound : 0
% 0.39/0.62 # BW rewrite match attempts : 42
% 0.39/0.62 # BW rewrite match successes : 29
% 0.39/0.62 # Condensation attempts : 189
% 0.39/0.62 # Condensation successes : 0
% 0.39/0.62 # Termbank termtop insertions : 32483
% 0.39/0.62 # Search garbage collected termcells : 9444
% 0.39/0.62
% 0.39/0.62 # -------------------------------------------------
% 0.39/0.62 # User time : 0.038 s
% 0.39/0.62 # System time : 0.011 s
% 0.39/0.62 # Total time : 0.050 s
% 0.39/0.62 # Maximum resident set size: 4196 pages
% 0.39/0.62
% 0.39/0.62 # -------------------------------------------------
% 0.39/0.62 # User time : 0.102 s
% 0.39/0.62 # System time : 0.030 s
% 0.39/0.62 # Total time : 0.133 s
% 0.39/0.62 # Maximum resident set size: 2216 pages
% 0.39/0.62 % E---3.1 exiting
% 0.39/0.63 % E exiting
%------------------------------------------------------------------------------